Granularity-Adaptive Proof Presentation
نویسندگان
چکیده
Granularity matters in mathematics. For example, in introductory textbooks intermediate proof steps are often skipped, when this seems appropriate. Such a situation is given in the elementary proof in basic set theory reproduced in Figure 1. Whereas most of the proof steps consist of the application of exactly one mathematical fact (a definition or a lemma), the step from assertion 9 to assertion 10 applies several inference steps at once, namely the application of the definition of ∩ twice, and the distributivity of and over or. Similar observations were made in the empirical studies within the Dialog project (cf. [8]). Systems like Ωmega [1] and HiProofs [4] are capable of structuring proofs hierarchically, the problem remains though how to identify a suitable level of granularity. Autexier and Fiedler have proposed one particular level of granularity [2], which they call what-you-need-is-what-you-stated granularity. Their rigid solution, however, fails to fully model the proof in Figure 1. We present a flexible approach to proof presentation that dynamically adapts to specific levels of granularity in context. Different models for granularity can be learned in our framework from samples using machine learning techniques. More information on the work sketched here is available in a technical report [8].
منابع مشابه
Presenting Proofs with Adapted Granularity
When mathematicians present proofs they usually adapt their explanations to their didactic goals and to the (assumed) knowledge of their addressees. Modern automated theorem provers, in contrast, present proofs usually at a fixed level of detail (also called granularity). Often these presentations are neither intended nor suitable for human use. A challenge therefore is to develop userand goal-...
متن کاملAn Alternative Stability Proof for Direct Adaptive Function Approximation Techniques Based Control of Robot Manipulators
This short note points out an improvement on the robust stability analysis for electrically driven robots given in the paper. In the paper, the author presents a FAT-based direct adaptive control scheme for electrically driven robots in presence of nonlinearities associated with actuator input constraints. However, he offers not suitable stability analysis for the closed-loop system. In other w...
متن کاملAn Alternative Stability Proof for Direct Adaptive Function Approximation Techniques Based Control of Robot Manipulators
This short note points out an improvement on the robust stability analysis for electrically driven robots given in the paper. In the paper, the author presents a FAT-based direct adaptive control scheme for electrically driven robots in presence of nonlinearities associated with actuator input constraints. However, he offers not suitable stability analysis for the closed-loop system. In other w...
متن کاملFocused Proof Search for Linear Logic in the Calculus of Structures
The proof-theoretic approach to logic programming has benefited from the introduction of focused proof systems, through the non-determinism reduction and control they provide when searching for proofs in the sequent calculus. However, this technique was not available in the calculus of structures, known for inducing even more non-determinism than other logical formalisms. This work in progress ...
متن کاملMEGA From Proof Planning towards Mathematical Knowledge Management
Higher Order Natural Deduction Proof Object Maintenance of proof developments at different layers of granularity which are connected to each other September 25th, 2003 – p.7 Source: Autexier, Benzmüller Proof Data Structure MEGA Main References [CheikhrouhouSorge-ACIDCA-00] Overview on PDS [SiekmannEtAl-35yAutomath] Working with PDS Discussion + Support for proof development at different levels...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009